منابع مشابه
Stochastic Shortest Path Games
We consider dynamic, two-player, zero-sum games where the \minimizing" player seeks to drive an underlying nite-state dynamic system to a special terminal state along a least expected cost path. The \maximizer" seeks to interfere with the minimizer's progress so as to maximize the expected total cost. We consider, for the rst time, undiscounted nite-state problems, with compact action spaces, a...
متن کاملStochastic Shortest Path Games and Q-Learning
We consider a class of two-player zero-sum stochastic games with finite state and compact control spaces, which we call stochastic shortest path (SSP) games. They are total cost stochastic dynamic games that have a cost-free termination state. Based on their close connection to singleplayer SSP problems, we introduce model conditions that characterize a general subclass of these games that have...
متن کاملCost allocation in shortest path games
A class of cooperative games arising from shortest path problems is deened. These shortest path games are shown to be totally balanced and allow a population-monotonic allocation scheme. Possible methods for obtaining core elements are indicated; rst, by relating to the allocation rules in taxation and bankruptcy problems, second, by constructing an explicit rule that takes opportunity costs in...
متن کاملFinding objects through stochastic shortest path problems
This paper presents a novel formulation for the problem of finding objects in a known environment while minimizing the search cost. Our approach consists in formalizing this class of problems as Stochastic Shortest Path (SSP) problems, a decision-theoretic framework for probabilistic environments. The obtained problems are solved by using offthe-shelf domain-independent probabilistic planners. ...
متن کاملDistributionally robust stochastic shortest path problem
This paper considers a stochastic version of the shortest path problem, the Distributionally Robust Stochastic Shortest Path Problem(DRSSPP) on directed graphs. In this model, the arc costs are deterministic, while each arc has a random delay. The mean vector and the second-moment matrix of the uncertain data are assumed known, but the exact information of the distribution is unknown. A penalty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 1999
ISSN: 0363-0129,1095-7138
DOI: 10.1137/s0363012996299557